Maximum reliable path under multiple failures
نویسنده
چکیده
In this work, we study the problem of maximizing path reliability in mesh networks against simultaneous failures of multiple network links. The links belong to shared risk link groups (SRLGs) that have arbitrary failure probabilities. This problem is NP-hard and we propose a heuristic algorithm for networks with large numbers of SRLGs as well as optimal solutions for networks with smaller numbers of SRLGs. The solutions are evaluated through computer simulations. Key-Words: path reliability, multiple failures, shared risk link group, routing
منابع مشابه
Evaluating Multipath TCP Resilience against Link Failures
Standard TCP is the de facto reliable transfer protocol for the Internet. It is designed to establish a reliable connection using only a single network interface. However, standard TCP with single interfacing performs poorly due to intermittent node connectivity. This requires the re-establishment of connections as the IP addresses change. Multi-path TCP (MPTCP) has emerged to utilize multiple ...
متن کاملReliable Routings in Networks with Generalized Link Failure Events
Traditional methods for ensuring reliable transmissions in circuitswitched networks rely on the pre computation of a backup path for every working path or for every network link These methods work fine as long as the network experiences only single link failures. They do not guarantee undisturbed communication, however, in the case of multiple link failures. Such failures are not seldom and oft...
متن کاملTowards Reliable Cloud Systems
TOWARDS RELIABLE CLOUD SYSTEMS Thanh D. Do Although providing tremendous access to data and computing power of thousands of commodity servers, large-scale cloud systems must address a new challenge: they must detect and recover from a growing number of failures, in both hardware and software components. The growing complexity of technology scaling, manufacturing, design logic, usage, and operat...
متن کاملNode Failure Localization in Communication Networks via Network Tomography
We investigate the problem of localizing node failures in a communication network from end-to-end path measurements, under the assumption that a path behaves normally if and only if it does not contain any failed nodes. To uniquely localize node failures, the measurement paths must show different symptoms under different failure events, i.e., for any two distinct sets of failed nodes, there mus...
متن کاملA routing framework for providing robustness to node failures in mobile ad hoc networks
Nodes in a mobile ad hoc network are often vulnerable to failures. The failures could be either due to fading effects, battery drainage, or as a result of compromised nodes that do not participate in network operations. Intermittent node failures can disrupt routing functionalities. As such, it is important to provide redundancy in terms of providing multiple node-disjoint paths from a source t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009